Energy Considerations for Divisible Load Processing
نویسنده
چکیده
In this paper we analyze energy usage in divisible load processing. Divisible load theory (DLT) applies to computations which can be divided into parts of arbitrary sizes, and the parts can be independently processed in parallel. The shortest schedule for divisible load processing is determined by the speed of computation and communication. Energy usage for such a time-optimum schedule is analyzed in this paper. We propose a simple model of energy consumption. Two states of the computing system are taken into account: an active state and an idle state with reduced energy consumption. Energy consumption is examined as a function of system parameters. We point out possible ways of energy conservation. It is demonstrated that energy can be saved by use of parallel processing.
منابع مشابه
Monetary Cost and Energy Use Optimization in Divisible Load Processing
In this paper divisible load scheduling theory is used to examine monetary cost and energy use optimization in a single level tree network. The problem is to find an optimal sequence for the distribution of the load to each processor that will minimize the monetary cost or energy consumption of the network. Optimization results from four different algorithms and their associated computation tim...
متن کاملOut-of-Core Divisible Load Processing
In this paper, we analyze processing divisible loads in systems with a memory hierarchy. Divisible loads are computations that can be divided into parts of arbitrary sizes and these parts can be independently processed in a distributed system. The problem is to partition the load so that the total processing time, including communications and computations, is the shortest possible. Earlier work...
متن کاملA Product Form Solution for Tree Networks with Divisible Loads
A product form solution for the optimal fractions of divisible load to distribute to processors in a multi-level tree network is described. Here optimality involves parallel processing the load in a minimal amount of time. This tractable solution is similar to the product form solution for equilibrium state probabilities arising in Markovian queueing networks. The existence of this product form...
متن کاملDominance properties for Divisible MapReduce Computations
In this paper we analyze MapReduce distributed computations as divisible load scheduling problem. The two operations of mapping and reducing can be understood as two divisible applications with precedence constraints. A divisible load model is proposed, and schedule dominance properties are analyzed. We investigate dominant schedule structures for MapReduce computations. To our best knowledge t...
متن کاملMulti-Criteria Based Algorithm for Scheduling Divisible Load
Divisible load theory has become a popular area of research during the past two decades. Based on divisible load theory the computations and communications can be divided into some arbitrarily independent parts and each part can be processed independently by a processor. Existing divisible load scheduling algorithms do not consider any priority for allocating fraction of load. In some situation...
متن کامل